Flexible Channel Coding Approach for Short-Length Codewords

Optimal Erasure Protection Assignment for Scalable Compressed Data with Small Channel Packets and Short Channel Codewords

This paper is concerned with the efficient transmission of scalable compressed data over lossy communication channels. Recent works have proposed several strategies for assigning optimal code redundancies to elements in a scalable data stream, under the assumption that all elements are encoded onto a common group of network packets. When the size of the data to be encoded becomes large in compa...

A Low-Power Variable Length Decoder for MPEG-2 Based on Successive Decoding of Short Codewords

This paper presents a low-power variable length decoder exploiting the statistics of successive codewords. The decoder employs small look-up tables working as fixed caches to reduce the number of activations of a variable length code detector where considerable power is consumed. The power simulation results estimated using PowerMill show that 35% energy is reduced on the average compared to th...

Joint Source { Channel Coding with Variable Length

Variable-length channel coding with noisy feedback

It is known that perfect noiseless feedback can be used to improve the reliability of communication systems. We show how to make those gains robust to noise on the feedback link. We focus on feedback links that are themselves discrete memoryless channels. We demonstrate that Forney’s erasure-decoding exponent is achievable given any positive-capacity feedback channel. We also demonstrate that a...

The FlexCode Channel Coding Approach

The FlexCode project is a joint research project of KTH Stockholm, RWTH Aachen University, Ericsson AB, Nokia Siemens Networks, and Orange/France Telecom under the umbrella of the sixth framework programme of the European Commission (http://www.flexcode.eu). In this paper we present the channel coding approach used in the FlexCode project. Furthermore, a brief introduction to the channel model ...